An algorithm for the MaxMin area triangulation of a convex polygon
نویسندگان
چکیده
Given a convex polygon in the plane, we are interested in triangulations of its interior, i.e. maximal sets of nonintersecting diagonals that subdivide the interior of the polygon into triangles. The MaxMin area triangulation is the triangulation of the polygon that maximizes the area of the smallest area triangle in the triangulation. There exists a dynamic programming algorithm that computes the optimal triangulation with respect to a number of optimality criteria in Θ(n) time and Θ(n) space, [4]. We present an algorithm that constructs the MaxMin area triangulation of a convex polygon in O(n log n log log n) time and O(n) space. The algorithm is based on the dynamic programming approach and uses a number of problem-specific geometric properties that are established within the paper.
منابع مشابه
Algorithms for optimal area triangulations of a convex polygon
Given a convex polygon with n vertices in the plane, we are interested in triangulations of its interior, i.e., maximal sets of nonintersecting diagonals that subdivide the interior of the polygon into triangles. The MaxMin area triangulation is the triangulation of the polygon that maximizes the area of the smallest triangle in the triangulation. Similarly, the MinMax area triangulation is the...
متن کاملNew Results on Optimal Area Triangulations of Convex Polygons
We consider the problems of finding two optimal triangulations of convex polygon: MaxMin area and MinMax area. These are the triangulations that maximize the area of the smallest area triangle in a triangulation, and respectively minimize the area of the largest area triangle in a triangulation, over all possible triangulations. The problem was originally solved by Klincsek by dynamic programmi...
متن کاملQuadratic Time Computable Instances of Maxmin and Minmax Area Triangulations of Convex Polygons
We consider the problems of finding two optimal triangulations of a convex polygon: MaxMin area and MinMax area. These are the triangulations that maximize the area of the smallest area triangle in a triangulation, and respectively minimize the area of the largest area triangle in a triangulation, over all possible triangulations. The problem was originally solved by Klincsek by dynamic program...
متن کاملAlgorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملUnited Nations Educational, Scientific and Cultural Organization and International Atomic Energy Agency THE ABDUS SALAM INTERNATIONAL CENTRE FOR THEORETICAL PHYSICS A LINEAR TIME ALGORITHM FOR FINDING THE CONVEX ROPES BETWEEN TWO VERTICES OF A SIMPLE POLYGON WITHOUT TRIANGULATION
The convex rope problem, posed by Peshkin and Sanderson in IEEE J. Robotics Automat, 2 (1986) pp. 53-58, is to find the counterclockwise and clockwise convex ropes starting at the vertex a and ending at the vertex b of a simple polygon, where a is on the boundary of the convex hull of the polygon and b is visible from infinity. In this paper, we present a linear time algorithm for solving this ...
متن کامل